204 Lila Kari and Laura

K−insertion and k−deletion closure of languages

The operation of k−insertion (k−deletion) is a generalization of the catenation (quotient) of words and languages. The k−insertion of w into u = u1u2 consists of all words u1wu2 where the length of u2 is at most k (k−deletion is performed in a analogous fashion). To a language L we associate the set k−ins(L) (k−del(L)) consisting of words with the following property: their k−insertion into (k−d...

Computational power of gene rearrangement

In 8] we proposed a model to describe the homologous recombi-nations that take place during massive gene rearrangements in hypotrichous ciliates. Here we develop the model by introducing the dependency of homol-ogous recombinations on the presence of certain contexts. We then prove that such a model has the computational power of a Turing machine. This indicates that, in principle, some unicell...

Codes, Involutions and Dna Encoding

Descriptional Complexity of Error/Edit Systems

Models of DNA Computation